13 research outputs found
Packet latency of deterministic broadcasting in adversarial multiple access channels
We study broadcasting in multiple access channels with dynamic packet
arrivals and jamming. Communication environments are represented by adversarial
models that specify constraints on packet arrivals and jamming. We consider
deterministic distributed broadcast algorithms and give upper bounds on the
worst-case packet latency and the number of queued packets in relation to the
parameters defining adversaries. Packet arrivals are determined by a rate of
injections and a number of packets that can be generated in one round. Jamming
is constrained by a rate with which an adversary can jam rounds and by a number
of consecutive rounds that can be jammed
Adversarial queuing on the multiple-access channel
We consider broadcasting on the multiple-access channel when packets are injected continuously. Multiple-access channel is a synchronous system with the properties that a single transmission at a round delivers the message to all nodes, while multiple simultaneous transmissions result in a conflict which prevents delivering messages to any among the recipients. The traditional approach to dynamic broadcasting has been concerned with stability of protocols under suitable stochastic assumptions about injection rates. We study deterministic protocols competing against adversaries restricted by injection rate and burstiness of traffic. Stability means that the number of packets in queues is bounded by a constant in any execution, for a given number of stations, protocol, and adversary. Strong stability denotes th
Deterministic Broadcast on Multiple Access Channels
Abstract—We study broadcasting on multiple access channels by deterministic distributed protocols. Data arrivals are governed by an adversary. The power of the adversary is constrained by the average rate of data injection and a bound on the number of different packets that can be injected in one round. The injection rate is at most 1, which forbids the adversary from overloading the channel. We consider a number of deterministic protocols. For each of them we give an upper bound on the worst-case packet latency, as a function of the constraints imposed on the adversary. We present results of experiments by simulations to compare packet latency of the deterministic protocols and of backoff-type randomized protocols. The experiments are carried out in a simulation environment that captures the burstiness of data injection and the resulting traffic by admissibility condition defined by the fraction of active stations and the rate of changing the status of active versus passive among the stations. I